#include<cstdio>//uncle-lu
#include<algorithm>
template<class T>void read(T &x)
{
	x=0;int f=0;char ch=getchar();
	while(ch<'0'||ch>'9') { f|=(ch=='-'); ch=getchar(); }
	while(ch<='9'&&ch>='0') { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); }
	x = f ? -x : x;
	return ;
}

int n, m, s;
int c[110][110];
int F[20010];

int main()
{
	read(s); read(n); read(m);
	for (int i = 1; i <= s; i++) 
		for (int j = 1; j <= n; j++) 
			read(c[j][i]), c[j][i] = c[j][i] * 2 + 1;

	for (int i = 1; i <= n; i++) 
		std::sort(c[i]+1, c[i]+1+s);

	for (int i = 1; i <= n; i++) 
	{
		for (int j = m; j >= 1; j--) 
		{
			for (int k = 1; k <= s; k++) 
			{
				if(c[i][k] > j)break;
				F[j] = std::max(F[j], F[j - c[i][k]] + k * i);
			}
		}
	}

	printf("%d", F[m]);

	return 0;
}
